Finding the Maximum Flow in a Network with Simple Paths
نویسندگان
چکیده
منابع مشابه
Finding simple paths and cycles in graphs
We describe a novel method, the method of random colorings, for finding simple paths and cycles of a specified length k in a graph G = (V,E). Using small bias probability spaces and families of perfect hash functions we can derandomize the randomized algorithms obtained using this method and obtain deterministic algorithms that establish the following new results: • For every fixed k, deciding ...
متن کاملFinding Regular Simple Paths in Graph Databases
We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodes connected by a simple path such that the concatenation of the labels along the path satisfies R. The problem is motivated by the observation that many recursive queries can be expressed in this form, and by the implementation of a query language, G+, based on this observation...
متن کاملOn finding a maximum flow in a network with special structure and some applications
1. In this paper we consider certain classes of integral flow networks. One class is formed by so-called simple networks. Special cases are: networks used for solving the problem on “set representatives” by P. Hall, networks constructed for finding minimum cut sets (sets of nodes separating two distinguished nodes of a graph), and networks for solving the problem on distinct common representati...
متن کاملThe Methods of Maximum Flow and Minimum Cost Flow Finding in Fuzzy Network
This article considers the problems of maximum flow and minimum cost flow determining in fuzzy network. Parameters of fuzzy network are fuzzy arc capacities and transmission costs of one flow unit represented as fuzzy triangular numbers. Conventional rules of operating with fuzzy triangular numbers lead to a strong “blurring” of their borders, resulting in loss of selfdescriptiveness of calcula...
متن کاملFinding k Simple Shortest Paths and Cycles
We present algorithms and hardness results for several problems related to finding multiple simple shortest paths in a graph. Our main result is a new algorithm for finding k simple shortest paths for all pairs of vertices in a weighted directed graph G = (V,E). For k = 2 our algorithm runs in O(mn + n logn) time where m and n are the number of edges and vertices in G. Our approach is based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications for Statistical Applications and Methods
سال: 2002
ISSN: 2287-7843
DOI: 10.5351/ckss.2002.9.3.845